|
|website = }} Shai Halevi ((ヘブライ語:שי הלוי); born 1966) is a computer scientist who works in the cryptography research group at IBM's Thomas J. Watson Research Center. Born in Israel in 1966, Halevi received him B.A. and M.Sc. in computer science from the Technion, Israel Institute of Technology in 1991 and 1993. He received his Ph.D. in Computer Science from MIT in 1997, and then joined IBM's Thomas J. Watson Research Center, where he is a Principal Research Staff Member. ==Research== Shai Halevi's research interests are in cryptography and security. He has published numerous original technical research papers, three of which were awarded the IBM Pat Goldberg memorial best-paper award (in 2004, 2012, and 2013). Notable contributions by Shai Halevi include: * Obfuscation. Halevi is a co-inventor of the first candidate general-purpose cryptographic obfuscation schemes, with security based on a mathematical conjecture.〔 〕 This development generated much interest in the cryptography community and was called "a watershed moment for cryptography."〔 * Cryptographic Multilinear Maps. Halevi is a co-inventor of Cryptographic Multilinear Maps (which constitute the main technical tool behind crytographic obfuscation and many other applications), solving a long-standing open problem〔Sanjam Garg, Craig Gentry, and Shai Halevi. (Candidate Multilinear Maps from Ideal Lattices ). In ''EUROCRYPT 2013'' (Springer) 〕〔(【引用サイトリンク】title=What are Cryptographic Multi-linear Maps? )〕 * Homomorphic Encryption. Halevi is one of the leading researchers on homomorphic encryption. He authored many articles,〔M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. (Fully Homomorphic Encryption over the Integers ). In ''EUROCRYPT 2010'' (Springer) 〕〔C. Gentry and S. Halevi. (Implementing Gentry's fully-homomorphic encryption scheme ). In ''EUROCRYPT 2011'' (Springer) 〕〔C. Gentry and S. Halevi. (Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits ). In ''FOCS 2011'' (IEEE) 〕〔C. Gentry, S. Halevi, and N. P. Smart. (Fully Homomorphic Encryption with Polylog Overhead ). In ''EUROCRYPT 2012'' (Springer) 〕〔C. Gentry, S. Halevi, and N. P. Smart. (Better Bootstrapping in Fully Homomorphic Encryption ). In ''PKC 2012'' (Springer) 〕〔C. Gentry, S. Halevi, and N. P. Smart. (Homomorphic Evaluation of the AES Circuit ). In ''CRYPTO 2012'' (Springer) 〕 gave invited lectures and tutorials on the topic,〔 (Fully Homomorphic Encryption ). Tutorial in the Winter School on Secure Computation and Efficiency, Bar-Ilan University, 2011.〕〔 (Fully Homomorphic Encryption ). Tutorial in CRYPTO 2011, UC Santa-Barbara〕〔 (Fully Homomorphic Encryption ). Invited lecture at the UCI Workshop on Lattices with Symmetry 〕 and he is also the principal developer (together with Victor Shoup) of the HElib homormophic-encryption software library.〔 〕〔S. Halevi and V. Shoup. (Algorithms in HElib ). In ''CRYPTO 2014'' 〕〔S. Halevi and V. Shoup. (Bootstrapping for HElib ). In ''Cryptology ePrint Archive''〕 * The Random Oracle Model. Halevi co-authored the influential work that pointed out for the first time the existence of "structurally flawed" cryptosystems that nonetheless have a proof of security in the random-oracle model. Since 2013 Halevi is the chair of the steering committee of the Theory of Cryptography Conference. He served on the board of directors of the International Association for Cryptologic Research. He chaired the CRYPTO conference in 2009 and co-chaired the TCC conference in 2006. Halevi also gave many invited talks, including in the USENIX Security Symposium in 2008 and the PKC conference in 2014. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shai Halevi」の詳細全文を読む スポンサード リンク
|